Automatic preference learning on numeric and multi-valued categorical attributes

نویسندگان

  • Lucas Marin
  • Antonio Moreno
  • David Isern
چکیده

One of the most challenging tasks in the development of recommender systems is the design of techniques that can infer the preferences of users through the observation of their actions. Those preferences are essential to obtain a satisfactory accuracy in the recommendations. Preference learning is especially difficult when attributes of different kinds (numeric or linguistic) intervene in the problem, and even more when they take multiple possible values. This paper presents an approach to learn user preferences over numeric and multi-valued linguistic attributes through the analysis of the user selections. The learning algorithm has been tested with real data on restaurants, showing a very good performance. Nowadays it is practically unconceivable to select our summer holiday destination or to choose which film to see in the cinema this weekend without consulting specialized sources of information in which, in some way or another, our preferences can be specified to aid the system to recommend us the best choices. That is because we live in an era where there are so many data easily available that it is impossible to manually filter every piece of information and evaluate it accurately. Recommender Systems (RS) have been designed to do this time-consuming task for us and, by feeding them with information about our interests, they are capable enough to tell us the best alternatives for us in a personal-ized way. The preferences of the user are stored in a structure called user profile. In this work, as usual in the literature, it will be considered that each decision alternative is represented through a set of values assigned to a certain set of predetermined attributes or criteria. In these situations, the user profile must somehow represent the preference of the user with respect to each of the possible values of the attributes. With this information, the RS may rate and rank the corpus of available decision alternatives and show it to the user to help him/her to make the final choice. The representation of the preferences, the recommendation process and the automatic management of the dynamic evolution of the preferences are three of the most challenging issues in the development of this type of systems [24]. Concerning the latter problem (how to learn automatically the preferences of the users), the RS requires some kind of information from the users to guide the learning process. This feedback may be obtained implicitly, explicitly or combining both approaches. …

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Preference Function Learning over Numeric and Multi-valued Categorical Attributes

One of the most challenging goals of recommender systems is to infer the preferences of users through the observation of their actions. Those preferences are essential to obtain a satisfactory accuracy in the recommendations. Preference learning is especially difficult when attributes of different kinds (numeric or linguistic) intervene in the problem, and even more when they take multiple poss...

متن کامل

Clustering Mixed Data via Diffusion Maps

Data clustering is a common technique for statistical data analysis, which is used in many fields, including machine learning, data mining, customer segmentation, trend analysis, pattern recognition and image analysis. Although many clustering algorithms have been proposed most of them deal with clustering of numerical data. Finding the similarity between numeric objects usually relies on a com...

متن کامل

Data Classification based on Decision Tree, Rule Generation, Bayes and Statistical Methods: An Empirical Comparison

In this paper, twenty well known data mining classification methods are applied on ten UCI machine learning medical datasets and the performance of various classification methods are empirically compared while varying the number of categorical and numeric attributes, the types of attributes and the number of instances in datasets. In the performance study, Classification Accuracy (CA), Root Mea...

متن کامل

Mining Optimized Association Rules with Categorical and Numeric Attributes

ÐMining association rules on large data sets has received considerable attention in recent years. Association rules are useful for determining correlations between attributes of a relation and have applications in marketing, financial, and retail sectors. Furthermore, optimized association rules are an effective way to focus on the most interesting characteristics involving certain attributes. ...

متن کامل

Random Ordinality Ensembles A Novel Ensemble Method for Multi-valued Categorical Data

Data with multi-valued categorical attributes can cause major problems for decision trees. The high branching factor can lead to data fragmentation, where decisions have little or no statistical support. In this paper, we propose a new ensemble method, Random Ordinality Ensembles (ROE), that circumvents this problem, and provides significantly improved accuracies over other popular ensemble met...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Knowl.-Based Syst.

دوره 56  شماره 

صفحات  -

تاریخ انتشار 2014